46 research outputs found
Graphs with degree sequence and
In this paper we study the class of graphs that have the same
degree sequence as two disjoint cliques and , as well as the class
of the complements of such graphs. We establish various
properties of and related to recognition,
connectivity, diameter, bipartiteness, Hamiltonicity, and pancyclicity. We also
show that several classical optimization problems on these graphs are NP-hard.Comment: Feedback is welcom